Pii: S0167-8396(02)00092-4
نویسندگان
چکیده
This paper presents a new kind of uniform splines, called hyperbolic polynomial B-splines, generated over the space Ω = span{sinh t, cosh t, tk−3, tk−4, . . . , t,1} in which k is an arbitrary integer larger than or equal to 3. Hyperbolic polynomial B-splines share most of the properties as those of the B-splines in the polynomial space. We give the subdivision formulae for this new kind of curves and then prove that they have the variation dimishing properties and the control polygons of the subdivisions converge. Hyperbolic polynomial B-splines can take care of freeform curves as well as some remarkable curves such as the hyperbola and the catenary. The generation of tensor product surfaces by these new splines is straightforward. Examples of such tensor product surfaces: the saddle surface, the catenary cylinder, and a certain kind of ruled surface are given in this paper. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0167-8396(02)00164-4
We study the relationship of transformations between Legendre and Bernstein basis. Using the relationship, we present a simple and efficient method for optimal multiple degree reductions of Bézier curves with respect to the L2-norm. 2002 Elsevier Science B.V. All rights reserved.
متن کاملPii: S0167-8396(02)00090-0
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial parametrization and by the absence of affine singularities. The algorithm requires O(n3 logn) field operations, where n is the degree of the curve. 2002 Elsevier Science B.V. All rights reserved.
متن کاملAn analytical model of adaptive wormhole routing with time-out
Several studies have shown that the performance advantages of adaptive routing over deterministic routing are reduced when the traffic contains strong degree of communication locality. This paper proposes a new analytical model of an adaptive routing algorithm proposed by Duato in [Dua94]. The main feature of this algorithm is the use of a time-out selection function for assigning virtual chann...
متن کاملRefinement operators for triangle meshes
Refinement operators for triangular meshes as used in subdivision schemes or remeshing are discussed. A numbering scheme is presented, covering all refinement operators that (topologically) map vertices onto vertices. Using this characterization, some special properties of n-adic and √ 3-subdivision are easy to see.
متن کاملAdjusting control points to achieve continuity
In this paper, I discuss a method for increasing the continuity between two functional triangular polynomial patches by adjusting their control points. The method described in this paper leaves the control points unchanged if the patches already meet with the desired level of continuity. As an example of using this construction, I give a simple method to construct a C0 patch network with high o...
متن کامل